Exploring Massive Incomplete Lineage Sorting in Arctoids (Laurasiatheria, Carnivora)
نویسندگان
چکیده
منابع مشابه
Exploring Massive Incomplete Lineage Sorting in Arctoids (Laurasiatheria, Carnivora).
Freed from the competition of large raptors, Paleocene carnivores could expand their newly acquired habitats in search of prey. Such changing conditions might have led to their successful distribution and rapid radiation. Today, molecular evolutionary biologists are faced, however, with the consequences of such accelerated adaptive radiations, because they led to sequential speciation more rapi...
متن کاملInferring phylogeny despite incomplete lineage sorting.
It is now well known that incomplete lineage sorting can cause serious difficulties for phylogenetic inference, but little attention has been paid to methods that attempt to overcome these difficulties by explicitly considering the processes that produce them. Here we explore approaches to phylogenetic inference designed to consider retention and sorting of ancestral polymorphism. We examine ho...
متن کاملIncomplete Lineage Sorting Is Common in Extant Gibbon Genera
We sequenced reduced representation libraries by means of Illumina technology to generate over 1.5 Mb of orthologous sequence from a representative of each of the four extant gibbon genera (Nomascus, Hylobates, Symphalangus, and Hoolock). We used these data to assess the evolutionary relationships between the genera by evaluating the likelihoods of all possible bifurcating trees involving the f...
متن کاملInferring Phylogenetic Networks with Maximum Pseudolikelihood under Incomplete Lineage Sorting.
Phylogenetic networks are necessary to represent the tree of life expanded by edges to represent events such as horizontal gene transfers, hybridizations or gene flow. Not all species follow the paradigm of vertical inheritance of their genetic material. While a great deal of research has flourished into the inference of phylogenetic trees, statistical methods to infer phylogenetic networks are...
متن کاملFast Algorithms for Reconciliation under Hybridization and Incomplete Lineage Sorting
Reconciling a gene tree with a species tree is an important task that reveals much about the evolution of genes, genomes, and species, as well as about the molecular function of genes. A wide array of computational tools have been devised for this task under certain evolutionary events such as hybridization, gene duplication/loss, or incomplete lineage sorting. Work on reconciling gene tree wit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Molecular Biology and Evolution
سال: 2015
ISSN: 0737-4038,1537-1719
DOI: 10.1093/molbev/msv188